Effective Parameter Method in Time-Dependent Neutron Slowing Down Problem
نویسندگان
چکیده
منابع مشابه
Critical slowing down in polynomial time algorithms.
Combinatorial optimization algorithms that compute exact ground states for disordered magnets are seen to exhibit critical slowing down at zero temperature phase transitions. Using the physical features of the models, such as vanishing stiffness on one side of the transition and the ground state degeneracy, the number of operations needed in the push-relabel algorithm for the random field Ising...
متن کاملA Mathematical Realization of Entropy through Neutron Slowing Down
Abstract: The slowing down equation for elastic scattering of neutrons in an infinite homogeneous medium is solved analytically by decomposing the neutron energy spectrum into collision intervals. Since scattering physically smooths energy distributions by redistributing neutron energy uniformly, it is informative to observe how mathematics accommodates the scattering process, which increases e...
متن کاملCarlo : computing the effective potential without critical slowing down
We present Tethered Monte Carlo, a simple, general purpose method of computing the effective potential of the order parameter (Helmholtz free energy). This formalism is based on a new statistical ensemble, closely related to the micromagnetic one, but with an extended configuration space (through Creutz-like demons). Canonical averages for arbitrary values of the external magnetic field are com...
متن کاملMonte Carlo : computing the effective potential without critical slowing down
We present Tethered Monte Carlo, a simple, general purpose method of computing the effective potential of the order parameter (Helmholtz free energy). This formalism is based on a new statistical ensemble, closely related to the micromagnetic one, but with an extended configuration space (through Creutz-like demons). Canonical averages for arbitrary values of the external magnetic field are com...
متن کاملA Time Dependent Pollution Routing Problem in Multi-graph
This paper considers a time dependent(the travel time is not constant throughout the day) pollution routing problem (TDPRP), which aids the decision makers in minimizing travel time, toll cost and emitted pollution cost. In complexity of urban areas most of the time one point is accessible from another with more than one edge. In contrast to previous TDPRP models, which are designed with only ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Nuclear Science and Technology
سال: 1975
ISSN: 1881-1248,0022-3131
DOI: 10.3327/jnst.12.217